The period is characterized by the consolidation of search-based methods and exact techniques for Vehicle Routing Problems with Time Windows and backhaul constraints, while extending to reverse logistics and closed-loop supply chains. Metaheuristic frameworks such as greedy randomized adaptive search procedures provide flexible, scalable means to generate high-quality routes under complex constraints, complemented by decomposition approaches to manage problem size. The field emphasizes solving realistic VRP variants and integrating practical performance with rigorous methods, bridging theory and application.